Concurrency measure in commutation monoids

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Commutation in Global Supermonoid of Free Monoids

This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition for commutation of languages are obtained, and in the prefix case the necessary and sufficient conditions are obtained. It is important to note that the considered alphabets and languages can be infinite. The possibilit...

متن کامل

Modelling Concurrency with Quotient Monoids

Four quotient monoids over step sequences and one with compound generators are introduced and discussed. They all can be regarded as extensions (of various degrees) of Mazurkiewicz traces [14] and comtraces of [10].

متن کامل

A Markovian Concurrency Measure

The aim of this work is to define a useful concurrency measure, easy to implement and whose computation complexity allows the study of real examples. We extend the measure introduced in [BT87] to a probabilistic one, by means of a natural translation of the synchronized automata of Arnold-Nivat's model to Markov chains: the computation of the measure uses the concept of average time before abso...

متن کامل

A Simple Run-time Concurrency Measure

A “concurrency measure” provides an objective means of comparing the level of parallelism achievable by a distributed computation. To date such measures have only been applicable after a computation has successfully terminated. This paper develops a notion of “observed concurrency” that can be continuously evaluated as a computation proceeds. It is suitable for nested parallelism and evaluation...

متن کامل

Garside monoids vs divisibility monoids

Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations (resp. be of Coxeter ty...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1989

ISSN: 0166-218X

DOI: 10.1016/0166-218x(92)90287-k